Cartoon Computation: Quantum-like computing without quantum mechanics

摘要

We present a computational framework based on geometric structures. Noquantum mechanics is involved, and yet the algorithms perform tasks analogousto quantum computation. Tensor products and entangled states are not needed --they are replaced by sets of basic shapes. To test the formalism we solve ingeometric terms the Deutsch-Jozsa problem, historically the first example thatdemonstrated the potential power of quantum computation. Each step of thealgorithm has a clear geometric interpetation and allows for a cartoonrepresentation.